Cubic Azaparacyclophane

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximately cubic functional equations and cubic multipliers

* Correspondence: abasalt. [email protected] Department of Mathematics, Garmsar Branch, Islamic Azad University, Garmsar, Iran Full list of author information is available at the end of the article Abstract In this paper, we prove the Hyers-Ulam stability and the superstability for cubic functional equation by using the fixed point alternative theorem. As a consequence, we show that the cubic m...

متن کامل

Cubic leaves

We determine those cubic graphs with at most 22 vertices which are leaves of partial triple systems. As a first step towards a complete characterization of cubic leaves, we also show several classes of cubic graphs to be leaves.

متن کامل

Cubic Polyhedra

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears many (but not all) of them can be relaxed to smooth minimal surfaces (under an appropriate smoothing flow, keeping their symmetries). Here we give a complete classification of the cubic polyhedra. Among these are five new infi...

متن کامل

Cubic groups

Post-nonclassical intuitionistic “natural” arithmetic with its fundamental simplifications in the case of the problem of asymptotic distribution of primes is considered. It is showed that an existence of the cubic groups and n3th density of prime distribution are assuming an existence of the one-way function of the form f(x3) = y, fˉ1(y) =?x3.

متن کامل

Total domination in cubic Knodel graphs

A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemistry Letters

سال: 1987

ISSN: 0366-7022,1348-0715

DOI: 10.1246/cl.1987.161